A Proposal for Indexing Bitemporal Databases via Cooperative B+-trees
نویسندگان
چکیده
In this paper we propose an indexing structure for bitemporal databases. Such structure is based on two trees, one indexing valid time and another indexing transaction time. The trees share pointers to the actual data records, which are thus not duplicated. Bitemporal queries are processed by dividing the query in two parts, a valid time part and a transaction time part. Each tree is searched according to these partial queries, and the answer is determined by the correct composition of the partial answers. We show how simple coordination of the tree searching, along with a simple assumption on the temporal data, improves query processing performance. The proposed structure also allows querying either time dimension, separately from the other one.
منابع مشابه
An Incremental Index for Bitemporal Databases
Bitemporal databases record not only the history of tuples in temporal tables, but also record the history of the databases themselves. Indexing structures, which are a critical issue in traditional databases, became even more critical for bitemporal databases. We address this problem by investigating an incremental indexing structure based on R-trees, called the HR-tree, which was originally a...
متن کاملR-Tree Based Indexing of Now-Relative Bitemporal Data
The databases of a wide range of applications, e.g., in data warehousing, store multiple states of time-evolving data. These databases contain a substantial part of now-relative data: data that became valid at some past time and remains valid until the current time. More specifically, two temporal aspects of data are frequently of interest, namely valid time, when data is true, and transaction ...
متن کاملLight-Weight Indexing of General Bitemporal Data
Most data managed by existing, real-world database applications is time referenced. Data warehouses are good examples. Often, two temporal aspects of data are of interest, namely valid time, when data is true in the mini-world, and transaction time, when data is current in the database, resulting in so-called bitemporal data. Like spatial data, bitemporal data thus has associated two-dimensiona...
متن کاملIndexing Valid Time Databases Via B+-trees – The MAP21 Approach
We present an approach named MAP21 which uses standard B+-trees, in a multiple disks single processor architecture, to provide efficient indexing of valid time ranges. The approach is based on mapping one dimensional ranges to one dimensional points where the lexicographical order among the ranges is preserved. We compare MAP21 to the Time Index and the R -tree and we show that MAP21 is compara...
متن کاملNatural and Efficient Modeling of Temporal Information with Object-Relational Databases
In this article we present a model for temporal data utilizing the benefits of object-relational database systems (ORDBS). In particular we show how attribute timestamping can be used for natural modeling of object attributes on the conceptual level and how this concept can be simply and efficiently implemented in state-of-the-art ORDBS. The attribute timestamping concept is based on introducin...
متن کامل